Abstracting Soft Constraints: Some Experimental Results on Fuzzy CSPs
نویسندگان
چکیده
ing Soft Constraints: Some Experimental Results on Fuzzy CSPs Stefano Bistarelli1 2, Francesca Rossi3, and Isabella Pilan3 1 Istituto di Informatica e Telematica, CNR, Pisa, Italy [email protected] 2 Dipartimento di Scienze Universitá degli Studi “G. D’annunzio” di Chieti-Pescara, Italy [email protected] 3 Dipartimento di Matematica Pura ed Applicata Università di Padova, Italy frossi,ipilan @math.unipd.it Abstract. Soft constraints are very flexible and expressive. However, they may also be very complex to handle. For this reason, it may be convenient in several cases to pass to an abstract version of a given soft problem, and then bring some useful information from the abstract problem to the concrete one. This will hopefully make the search for a solution, or for an optimal solution, of the concrete problem, faster. In this paper we review the main concepts and properties of our abstraction framework for soft constraints, and we show some experimental results of its application to the solution of fuzzy constraints. Soft constraints are very flexible and expressive. However, they may also be very complex to handle. For this reason, it may be convenient in several cases to pass to an abstract version of a given soft problem, and then bring some useful information from the abstract problem to the concrete one. This will hopefully make the search for a solution, or for an optimal solution, of the concrete problem, faster. In this paper we review the main concepts and properties of our abstraction framework for soft constraints, and we show some experimental results of its application to the solution of fuzzy constraints.
منابع مشابه
بهینه سازی برنامه ریزی هفتگی دروس دانشگاهی با روشهای جستجوی محلی
University course timetabling problem is a complicated problem and finding a computer-aided solution for it was a subject to work for many years. To solve this problem, we must assign courses to timeslots with respect to hard and soft constraints. Hard constraints are those which must be necessarily met (some of them could be neglected with high costs). Our aim is to meet as many soft constrain...
متن کاملThe Next Best Solution
We study the computational complexity of finding the next most preferred solution in some common formalisms for representing constraints and preferences. The problem is computationally intractable for CSPs, but is polynomial for tree-shaped CSPs and tree-shaped fuzzy CSPs. On the other hand, it is intractable for weighted CSPs, even under restrictions on the constraint graph. For CP-nets, the p...
متن کاملk-Hyperarc Consistency for Soft Constraints over Divisible Residuated Lattices
We investigate the applicability of divisible residuated lattices (DRLs) as a general evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs are in fact natural candidates for this role, since they form the algebraic semantics of a large family of substructural and fuzzy logics [GJKO07, Háj98]. We present the following results. (i) We show that DRLs subsume important v...
متن کاملCompiling Semiring-Based Constraints with clp (FD, S)
In some recent works, a general framework for nite domains constraint satisfaction has been deened, where classical CSPs, fuzzy CSPs, weighted CSPs, partial CSPs and others can be easily cast. This framework, based on a semiring structure, allows, under certain conditions , to compute arc-consistency. Restricting to that case and integrating semiring-based constraint solving in the Constraint L...
متن کاملExperimental Evaluation of Interchangeability in Soft CSPs
In [8], Freuder defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently [2], we extended the definition of interchangeability to Soft CSPs and we introduced two notions of relaxation based on degradation δ and on threshold α (neighborhood interchangeability (NI )and α neighborhood interchangeability (αNI )). In this paper we extend the study introduced in [11]...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003